1
کامپیوتر و شبکه::
الگوریتم زودترین زمان پایان ناهمگن-HEFT
makespan resulted from running the HEFT scheduling algorithm
Since the HEFT main target is to achieve the least finish time
The Heterogeneous Earliest Finish Time ( HEFT) [22] is one of
outperforms the other competitors' HEFT, DEWTS, Wu [36], and
Although HEFT has the least time complexity, it consumes
واژگان شبکه مترجمین ایران